An Efficient Implementation of the PC - Tree Algorithm of
نویسنده
چکیده
In Shih & Hsu [9] a simpler planarity test was introduced utilizing a data structure called PC-trees (generalized from PQ-trees). In this paper we give an efficient implementation of that linear time algorithm and illustrate in detail how to obtain a Kuratowski’s subgraph when the given graph is not planar and how to obtain the embedding alongside the testing algorithm. The main part of the implementation is devoted to the treatment of the C-nodes representing those 2-connected components.
منابع مشابه
An efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملAn Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems
An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...
متن کاملAn Efficient Implementation of the PC-Tree Algorithm of Shih & Hsu’s Planarity Test
In Shih & Hsu [9] a simpler planarity test was introduced utilizing a data structure called PC-trees (generalized from PQ-trees). In this paper we give an efficient implementation of that linear time algorithm and illustrate in detail how to obtain a Kuratowski subgraph when the given graph is not planar, and how to obtain the embedding alongside the testing algorithm. We have implemented the a...
متن کاملAccurate Fruits Fault Detection in Agricultural Goods using an Efficient Algorithm
The main purpose of this paper was to introduce an efficient algorithm for fault identification in fruits images. First, input image was de-noised using the combination of Block Matching and 3D filtering (BM3D) and Principle Component Analysis (PCA) model. Afterward, in order to reduce the size of images and increase the execution speed, refined Discrete Cosine Transform (DCT) algorithm was uti...
متن کاملAN EFFICIENT METAHEURISTIC ALGORITHM FOR ENGINEERING OPTIMIZATION: SOPT
Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems so far. In the present study, a simple optimization (SOPT) algorithm with two main steps namely exploration and exploitation, is provided for practical applications. Aside from a reasonable rate of convergence attained, the ease in its implementation and dependen...
متن کامل